On Bu erless Routing of Variable Length Messages in Leveled Networks
نویسندگان
چکیده
We study the most general communication paradigm on a multiprocessor, wherein each processor has a distinct message (of possibly distinct lengths) for each other processor. We study this paradigm, which we call chatting, on multiprocessors that do not allow messages once dispatched ever to be delayed on their routes. By insisting on oblivious routes for messages, we convert the communication problem to a pure scheduling problem. We introduce the notion of a virtual chatting schedule, and we show how eecient chatting schedules can often be produced from eecient virtual chatting schedules. We present a number of strategies for producing eecient virtual chatting schedules on a variety of network topologies.
منابع مشابه
On Bufferless Routing of Variable Length Messages in Leveled Networks
We study the most general communication paradigm on a multiprocessor, wherein each processor has a distinct message (of possibly distinct lengths) for each other processor. We study this paradigm, which we call chatting, on multiprocessors that do not allow messages once dispatched ever to be delayed on their routes. By insisting on oblivious routes for messages, we convert the communication pr...
متن کاملMLCA: A Multi-Level Clustering Algorithm for Routing in Wireless Sensor Networks
Energy constraint is the biggest challenge in wireless sensor networks because the power supply of each sensor node is a battery that is not rechargeable or replaceable due to the applications of these networks. One of the successful methods for saving energy in these networks is clustering. It has caused that cluster-based routing algorithms are successful routing algorithm for these networks....
متن کاملFair Scheduling in an Optical Interconnection Network
Existing fair scheduling schemes have focused primarily on scheduling multiple ows to a single output. The limited work that has focused on scheduling multiple ows to multiple outputs has assumed a non-blocking, slotted-time, cell-based network with a centralized controller. This paper presents a fair scheduler suitable for use in bu erless circuit-switched blocking networks operating with dist...
متن کاملA Loss Model for VBR Sources in ATM Networks
A variable bit rate source is modeled as a Markov modulated deterministic uid ow (MMDFF) process. Each state in the stationary discrete time Markov chain represents one of a nite number of deterministic messages of xed lengths and variable bit rates. At the user network interface this sequence is served at a constant bit rate with a bu er of xed length. The combined system forms a regenerative ...
متن کاملBest-E ort Bandwidth Reservation in High Speed LANs using Wormhole Routing
Current quality of service schemes require switching nodes to identify and manipulate packets within large switch bu ers. These methods are e ective for networks with switching nodes that contain su cient resources, such as in ATM networks. However, in wormhole routing networks like Myrinet, the emphasis on providing low latency and high link speeds at a low cost precludes the use of intelligen...
متن کامل